Multiobjective Optimization Solution for Shortest Path Routing Problem
نویسندگان
چکیده
The shortest path routing problem is a multiobjective nonlinear optimization problem with constraints. This problem has been addressed by considering Quality of service parameters, delay and cost objectives separately or as a weighted sum of both objectives. Multiobjective evolutionary algorithms can find multiple pareto-optimal solutions in one single run and this ability makes them attractive for solving problems with multiple and conflicting objectives. This paper uses an elitist multiobjective evolutionary algorithm based on the Non-dominated Sorting Genetic Algorithm (NSGA), for solving the dynamic shortest path routing problem in computer networks. A priority-based encoding scheme is proposed for population initialization. Elitism ensures that the best solution does not deteriorate in the next generations. Results for a sample test network have been presented to demonstrate the capabilities of the proposed approach to generate well-distributed pareto-optimal solutions of dynamic routing problem in one single run. The results obtained by NSGA are compared with single objective weighting factor method for which Genetic Algorithm (GA) was applied. Keywords—Multiobjective optimization, Non-dominated Sorting Genetic Algorithm, Routing, Weighted sum.
منابع مشابه
A Nondominated Sorting Genetic Algorithm for Shortest Path Routing Problem
The shortest path routing problem is a multiobjective nonlinear optimization problem with constraints. This problem has been addressed by considering Quality of service parameters, delay and cost objectives separately or as a weighted sum of both objectives. Multiobjective evolutionary algorithms can find multiple pareto-optimal solutions in one single run and this ability makes them attractive...
متن کاملParametric search and problem decomposition for approximating Pareto-optimal paths
The multiobjective shortest path problem arises in many transportation and logistics applications, either as a stand-alone network routing problem or a subroutine of a more complex multiobjective network optimization problem. It has been addressed by different solution strategies, including labeling methods, ranking methods, constraint methods, and parametric methods. Increasing attention has b...
متن کاملEvolutionary Algorithms for the Multiobjective Shortest Path Problem
This paper presents an overview of the multiobjective shortest path problem (MSPP) and a review of essential and recent issues regarding the methods to its solution. The paper further explores a multiobjective evolutionary algorithm as applied to the MSPP and describes its behavior in terms of diversity of solutions, computational complexity, and optimality of solutions. Results show that the e...
متن کاملA Genetic Algorithm Approach for Solving the Routing and Wavelength Assignment Problem in WDM Networks
The Static RWA(Routing and Wavelength Assignment) problem in WDM optical network is a combinatorial optimization problem fit to iterative search methods. In this paper we formulate the Static RWA problem in optical network as a single objective as well as a multiobjective optimization problem and solve it in a novel way using Evolutionary Algorithms. A hybrid approach based on the -shortest pat...
متن کاملWhat Algorithms for Urban Routing on Mobile Devices?
This article presents a model for the multimodal shortest path problem. That model allows to use existing shortest path algorithm implementation and thus is very efficient and optimal. The performances are well suited for a mobile device like a smartphone. We also present how multiobjective optimization improves the user interface by presenting similar solutions without any user interaction. Fi...
متن کامل